Control Allocation with Load Balancing
نویسندگان
چکیده
Next generation aircraft with a large number of actuators will require advanced control allocation methods to compute the actuator commands needed to follow desired trajectories while respecting system constraints. Previously, algorithms were proposed to minimize the l1 or l2 norms of the tracking error and of the actuator deflections. The paper discusses the alternative choice of the l∞ norm, or sup norm. Minimization of the control effort translates into the minimization of the maximum actuator deflection (min-max optimization). The paper shows how the problem can be solved effectively by converting it into a linear program and solving it using a simplex algorithm. Properties of the algorithm are also investigated through examples. In particular, the min-max criterion results in a type of load balancing, where the load is the desired command and the algorithm balances this load among various actuators. The solution using the l∞ norm also results in better robustness to failures and to lower sensitivity to nonlinearities in illustrative examples.
منابع مشابه
On Simple Algorithms for Dynamic Load Balancing
This paper focuses on the dynamic resource allocation problem. In communication networks such as wireless or circuit switching networks, resources correspond to base stations or links, and the load corresponds to the calls in the network. The principle of load balancing is examined for dynamic resource allocation. The question of interest is the performance of simple allocation strategies which...
متن کاملA Control-based Load Balancing Algorithm with Flow Control for Dynamic and Heterogeneous Servers
Although load balancing is a fundamental and well-studied problem in resource allocation, the ever changing scenarios and technologies in distributed systems demand new approaches and algorithms. In this context, we consider a real world scenario where servers are heterogeneous and have dynamic background loads not controlled by the load balancer. In such scenarios, classic round robin policy o...
متن کاملExecution Analysis of Load Balancing Algorithms in Cloud Computing Environment
The concept oft Cloud computing has significantly changed the field of parallel and distributed computing systems today. Cloud computing enables a wide range of users to access distributed, scalable, virtualized hardware and/or software infrastructure over the Internet. Load balancing is a methodology to distribute workload across multiple computers, or other resources over the network links to...
متن کاملAnalysis of Simple Algorithms for Dynamic Load Balancing
The principle of load balancing is examined for dynamic resource allocation subject to certain constraints The emphasis is on the performance of simple allocation strategies which can be implemented on line Either nite capacity constraints on resources or migration of load can be incorporated into the setup The load balancing problem is formulated as a stochastic optimal control problem Variant...
متن کاملMulticast Routing and Spectrum Allocation Algorithm Based on QOS Constraints Load Balancing in Wireless Network
To deal with the issues like existing generation of congestion nodes and redundancy transmission in the traditional load balancing algorithm, this paper puts forward the load balance multicast routing and spectrum allocation algorithm based on QOS constraints. The algorithm adopts LBWC algorithm to calculate the wireless link weight, and carries out the structure of the load balancing multicast...
متن کاملDynamic Load Balancing Strategies in Heterogeneous Distributed System
Distributed heterogeneous computing is being widely applied to a variety of large size computational problems. This computational environments are consists of multiple heterogeneous computing modules, these modules interact with each other to solve the problem. Dynamic load balancing in distributed computing system is desirable because it is an important key to establish dependability in a Hete...
متن کامل